Exact and heuristic solutions for combinatorial optimization problems
نویسنده
چکیده
منابع مشابه
Two Combinatorial Optimization Problems at the Interface of Computer Science and Operations Research By
Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems has been of great interest to both researchers and practitioners. Over the last half century, vast amounts of research have been devoted to studying various methods in tackling these problems. These methods can be divided into two categor...
متن کاملEstimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation
Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملParallel Solution Methods for Vehicle Routing Problems
Parallel solution methods contribute to efficiently address large and complex combinatorial optimization problems, vehicle routing problems in particular. Parallel exact and heuristic methods for VRP variants are increasingly being proposed and the pace seem to increase in recent years. “New” strategies have been proposed and many of the best known solutions to classical formulations have been ...
متن کاملNonlinear Assignment Problems in Manufacturing
Nonlinear Assignment Problems (NAPs) are combinatorial optimization problems for which no exact algorithm exists that can solve them in reasonable computational time. They enjoy applications in diverse areas, such as location theory, data association problems, physics, manufacturing and many others. This talk is divided into two parts. First an overview of NAPs will be presented, where diierent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- 4OR
دوره 12 شماره
صفحات -
تاریخ انتشار 2014